منابع مشابه
m-Consensus Objects Are Pretty Powerful
A recent paper by Afek, Ellen, and Gafni introduced a family of deterministic objects Om,k, for m, k ≥ 2, with consensus numbers m such that, for each k ≥ 2, Om,k is computationally less powerful than Om,k+1 in systems with at least mk+m+k processes. This paper gives a wait-free implementation of Om,k from (m+ 1)-consensus objects and registers in systems with any finite number of processes. In...
متن کاملStrictly Pretty
Pretty printers are tools for formatting structured text. A recently taken algebraic approach has lead to a systematic design of pretty printers. Wadler has proposed such an algebraic pretty printer together with an implementation for the lazy functional language Haskell. The original design causes exponential complexity when literally used in a strict language. This note recalls some propertie...
متن کاملPretty Secure BGP, psBGP
The Border Gateway Protocol (BGP) is an IETF standard inter-domain routing protocol on the Internet. However, it is well known that BGP is vulnerable to a variety of attacks, and that a single misconfigured or malicious BGP speaker could result in large scale service disruption. We first summarize a set of security goals for BGP, and then propose Pretty Secure BGP (psBGP) as a new security prot...
متن کاملPretty Good Gravity
A theory of topological gravity is a homotopy-theoretic representation of the Segal-Tillmann topologification of a two-category with cobordisms as morphisms. This note describes a relatively accessible example of such a thing, suggested by the wall-crossing formulas of Donaldson theory. 1. Gravity categories A cobordism category has manifolds as objects, and cobordisms as morphisms. Such catego...
متن کاملPretty Good Democracy
Code voting seeks to address the issues of privacy and integrity for Remote Internet Voting. It sidesteps many of the inherent vulnerabilities of the Internet and client platforms but it does not provide end-to-end verification that votes are counted as cast. In this paper, we propose a simple technique to enhance the verifiability of code voting by ensuring that the Vote Server can only access...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: British Dental Journal
سال: 2011
ISSN: 0007-0610,1476-5373
DOI: 10.1038/sj.bdj.2011.153